Orthogonal Compaction using Additional Bends
نویسندگان
چکیده
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing area, but at the expense of additional bends.
منابع مشابه
An Experimental Comparison of Orthogonal Compaction Algorithms
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also ...
متن کاملDrawing Metro Maps on Concentric Circles
This thesis examines algorithms for the drawing of metro maps. The most important elements of a metro map are stations and lines connecting the stations. In the context of this thesis, we restrict the elements used for representing lines to one of two classes: On the one hand, circular segments lying on circles with a common center S are allowed. On the other hand, line segments lying on lines ...
متن کاملAn Algorithm for Three-Dimensional Orthogonal Graph Drawing
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cube. For an n-vertex m-edge graph with maximum degree six, the algorithm produces drawings with bounding box volume at most 2.37n and with a total of 7m/3 bends, using no more than 4 bends per edge route. For maximum degree five ...
متن کاملMechanism of DNA compaction by yeast mitochondrial protein Abf2p.
We used high-resolution atomic force microscopy to image the compaction of linear and circular DNA by the yeast mitochondrial protein Abf2p, which plays a major role in packaging mitochondrial DNA. Atomic force microscopy images show that protein binding induces drastic bends in the DNA backbone for both linear and circular DNA. At a high concentration of Abf2p DNA collapses into a tight nucleo...
متن کاملA Pairing Technique for Area-eecient Orthogonal Drawings ? (extended Abstract)
An orthogonal drawing of a graph is a drawing such that vertices are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area no greater than 0:76n 2 , and introduces n...
متن کامل